A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm

It is possible to represent the road map on paper and study it using Dijkstra`s algorithm find shortest path real earth. Algorithms are used for calculating from source sink enable query operations that follow. Dynamic shortest-route techniques needed accommodate modifications within underlying community topology. Every solution includes figuring out nodes whose routes could be impacted through updates producing a list of affected vertices their updated pathways. In this work, advent retroactive priority queue information structure makes Dijkstra dynamic. research, stepping changed forward in direction 2 networks two directions. That by locating static path, then circulating first node after beginning node. At node, weights inside segments directed will exchange cancel vintage locate new direction. Then flow next repeat operation until end. The idea best can constantly based latest data. These continuous changes addressed paper, where proposed system methods update them automatically according variables.